Linearized Wenger graphs
نویسندگان
چکیده
Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of the similar type, called linearized Wenger graphs. The spectrum, diameter and girth of these linearized Wenger graphs are determined.
منابع مشابه
Linearized Reed-Solomon codes and linearized Wenger graphs
Let m, d and k be positive integers such that k ≤ me , where e = (m, d). Let p be an prime number and π a primitive element of Fpm . To each ~a = (a0, · · · , ak−1) ∈ F k pm , we associate the linearized polynomial f~a(x) = k−1 ∑ j=0 ajx p . And, to each f~a(x), we associated the sequence c~a = (f~a(1), f~a(π), · · · , f~a(π pm−2)). Let C = {c~a | ~a ∈ F k pm} be the cyclic code formed by the s...
متن کاملThe Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
The linearized Bregman method is a method to calculate sparse solutions to systems of linear equations. We formulate this problem as a split feasibility problem, propose an algorithmic framework based on Bregman projections, and prove a general convergence result for this framework. Convergence of the linearized Bregman method will be obtained as a special case. Our approach also allows for sev...
متن کاملUniquely C 4-Saturated Graphs
For a fixed graph H, a graph G is uniquely H-saturated if G does not contain H, but the addition of any edge from G to G completes exactly one copy of H. Using a combination of algebraic methods and counting arguments, we determine all the uniquely C4-saturated graphs; there are only ten of them.
متن کاملA note on the saturation number of the family of k-connected graphs
Given a family of graphs F , a graph G is F-saturated if no member of F is a subgraph of G, but for all e ∈ E(G), some member of F is a subgraph of G+ e. The saturation number of F , denoted sat(n,F), is the minimum number of edges in an n-vertex F-saturated graph. In this note we determine the saturation number for the family of k-connected graphs.
متن کاملComplete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of matchings, extended by a binary number indicating whether the matching contains two specific edges. This polytope is associated to the quadratic matching problem with a single linearized quadratic term. We provide a complete irredundant inequality description, which settles a conjecture by Klein (Ph.D. the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 338 شماره
صفحات -
تاریخ انتشار 2015